Location:
Search - pso in c
Search list
Description: 针对目前粒子群算法（Particle Swarm Optimization）一般是用MATLAB实现的，对PSO算法用C实现的代码-In view of the current PSO (Particle Swarm Optimization) is generally used MATLAB' s implementation of the PSO algorithm implementation using C code
Platform: |
Size: 1024 |
Author: yanguang |
Hits:
Description: 改进的粒子群算法--自适应粒子群算法，在普通的粒子群算法里面加入了熵和平均粒距的概念，收敛速度大大提高，用C实现-Improved particle swarm- adaptive particle swarm optimization, in which ordinary PSO joined the entropy and the concept of average distance, speed up the convergence, with the C implementation
Platform: |
Size: 169984 |
Author: 翁海冰 |
Hits:
Description: This paper proposes a novel and computationally efficient global I< optimization method based on swarm ntelligence for locating ti nodes in a WSN environment. The mean squared range error of a
all neighbouring anchor nodes is taken as the objective function d for this non linear optimization problem. The Particle Swarm c
Optimization (PSO) is a high performance stochastic global b optimization tool that ensures the minimization of the objective a
function, ,This paper proposes a novel and computationally efficient global I< optimization method based on swarm ntelligence for locating ti nodes in a WSN environment. The mean squared range error of a
all neighbouring anchor nodes is taken as the objective function d for this non linear optimization problem. The Particle Swarm c
Optimization (PSO) is a high performance stochastic global b optimization tool that ensures the minimization of the objective a
function,
Platform: |
Size: 2195456 |
Author: Mohd Elsoufi |
Hits:
Description: PSO聚类算法使用的数据是我们归一化后的数据，利用该数据求总的粒子数m,设置聚类数c（c=4,这个可以确定的），随机选择聚类中心并赋值给各个粒子，随机产生粒子的速度；-PSO clustering algorithm using data owned by a data after the data requirements to the total number of particles in m, set the number of clusters c (c = 4, this can be determined), the random selection of cluster centers and assigned to the each particle velocity of the particles, randomly generated
Platform: |
Size: 2048 |
Author: 李毅 |
Hits:
Description: 标准PSO算法代码采用C++编制；注释丰富；带有测试函数；测试函数在（0，-1）处取得最小值3。-Standard PSO algorithm code using C++ preparation Notes rich with test function test function in (0,-1) obtained at the minimum three.
Platform: |
Size: 10240 |
Author: 汤德琴 |
Hits:
Description: 标准PSO算法代码采用C++编制；注释丰富；带有测试函数；测试函数在（0，-1）处取得最小值3。编译运行通过修改优化模型即可直接用来优化你所需求解问题,本人在弹道优化方面已测试成功。代码内总共进行50次pso搜索运算，以提高算法的可靠性，迭代最大次数限制在500次以内，输出最佳适应值和取得最佳适应值时的迭代次数，平均进行每次pso运算要多少次迭代才能得到满足条件的解-Standard PSO algorithm code using C++ preparation Notes rich with test function test function in (0,-1) obtained at the minimum three. Compile and run directly by modifying the optimization model is used to optimize you need to solve the problem, I have been tested in the trajectory optimization success. A total of 50 times the code pso search operator to improve the reliability of the algorithm, the maximum number of iterations is limited to less than 500, the output value and the best fitness value to obtain the best fit of iterations, the average for each operation to the number of pso iterations to meet the conditions to get the solution ......
Platform: |
Size: 11264 |
Author: ke |
Hits:
Description: 标准PSO算法代码采用C++编制；注释丰富；带有测试函数；测试函数在（0，-1）处取得最小值3。编译运行通过修改优化模型即可直接用来优化你所需求解问题,本人在弹道优化方面已测试成功。代码内总共进行50次pso搜索运算，以提高算法的可靠性，迭代最大次数限制在500次以内，输出最佳适应值和取得最佳适应值时的迭代次数，平均进行每次pso运算要多少次迭代才能得到满足条件的解-Standard PSO algorithm using C++ code compiled Notes rich with test function test function in (0,-1) obtained at the minimum three. Compile and run directly by modifying the optimization model is used to optimize you need to solve the problem, I have been tested in the trajectory optimization success. A total of 50 times the code pso search operator to improve the reliability of the algorithm, the maximum number of iterations is limited to less than 500, the output value and the best fitness value to obtain the best fit of iterations, the average for each operation to the number of pso iterations to meet the conditions to get the solution ......
Platform: |
Size: 11264 |
Author: 任行 |
Hits:
Description: PSO：粒子群优化算法，用C++和matlab两种语言实现的
RVM:相关向量机，比SVM更高级些
样本熵和近似熵：计算动态系统中时间序列的一个重要手段-PSO: PSO algorithm, using C++ and matlab realization of two languages
RVM: relevance vector machine, some more advanced than SVM
Sample entropy and approximate entropy: Calculating an important means of dynamic system in time series
Platform: |
Size: 294912 |
Author: 夏德玲 |
Hits:
Description: 多目标粒子群优化算法C++代码，一个墨西哥人写的-Multi-objective particle swarm optimization C++ code, written in a Mexican
Platform: |
Size: 19456 |
Author: 雷震 |
Hits:
Description: I want to state that according to my previous month bill (M/S Gangesh kumar A/C no 400363210)was approx. INR 300 TO 400 But in month of august its INR 2000 .when complain was lodged to RO they said its software fault
Platform: |
Size: 1024 |
Author: Gangesh Jha |
Hits:
Description: 利用粒子群算法搜索多项式的最优解，本例中为二元多项式，采用c++实现-Polynomial using particle swarm algorithm to search optimal solution, in this case binary polynomial, use c++ realize
Platform: |
Size: 1156096 |
Author: frank |
Hits:
Description: this the code source in c of particle swarm optimisation (PSO)with a simple function-this is the code source in c of particle swarm optimisation (PSO)with a simple function
Platform: |
Size: 1024 |
Author: asmaa_ma |
Hits:
Description: PSO优化算法，C++版本源代码，可参照执行。-PSO optimization algorithm developed in VS2010
Platform: |
Size: 1024 |
Author: fangdajun |
Hits:
Description: 1. Run mex -setup and choose a proper complier (Microsoft Visual C++ 6.0 is prefered)
Would you like mex to locate installed compilers [y]/n? y
2. Put cec15_func.cpp and input_data folder with your algorithm in the same folder. Set this folder as the current path.
3. Run the following command in Matlab window:
mex cec15_func.cpp -DWINDOWS
4. Then you can use the test functions as the following example:
f = cec15_func(x,func_num)
here x is a D*pop_size matrix.
5. main.m is an example test code with PSO algorithm.-1. Run mex -setup and choose a proper complier (Microsoft Visual C++ 6.0 is prefered)
Would you like mex to locate installed compilers [y]/n? y
2. Put cec15_func.cpp and input_data folder with your algorithm in the same folder. Set this folder as the current path.
3. Run the following command in Matlab window:
mex cec15_func.cpp -DWINDOWS
4. Then you can use the test functions as the following example:
f = cec15_func(x,func_num)
here x is a D*pop_size matrix.
5. main.m is an example test code with PSO algorithm.
Platform: |
Size: 2034688 |
Author: bhalab |
Hits:
Description: 粒子群优化算法C语言程序，供感兴趣的人一起学习。-PSO C language program for people interested in learning together.
Platform: |
Size: 268288 |
Author: 周志鑫 |
Hits:
Description: 该程序是基于粒子群算法优化支持向量机中的正则化参数C和核函数参数K的算法，实现了对电力负荷的短期预测，预测效果较好，可根据自己要求进行更改。-The algorithm is based on particle swarm optimization algorithm to optimize regularization parameter C and kernel function parameter K in support vector machine. It realizes the short-term prediction of power load, and the prediction effect is good, and can be changed according to the requirements.
Platform: |
Size: 12288 |
Author: 郭鹏飞 |
Hits:
Description: 粒子群算法，也称粒子群优化算法（Particle Swarm Optimization），缩写为 PSO， 是近年来由J. Kennedy和R. C. Eberhart等[1] 开发的一种新的进化算法(Evolutionary Algorithm - EA)。PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法。-Swarm optimization, also known as PSO (Particle Swarm Optimization), abbreviated as PSO, in recent years, one J. Kennedy and RC Eberhart et al. [1] developed a new evolutionary algorithm (Evolutionary Algorithm- EA). One of PSO algorithm and simulated annealing algorithm is similar to evolutionary algorithms, it is also a departure random solutions, through iterative find the optimal solution, it is also uated by the fitness of the solution quality, but it' s simpler than genetic algorithm rules it is no genetic algorithm " cross" (crossover) and " variation" (mutation) operation, follow it through to the current search to find the optimal value of the global optimum. This algorithm is its easy implementation, high precision, rapid convergence, etc. attracted academic attention, and demonstrated its superiority in solving practical problems. Particle swarm algorithm is a parallel algorithm.
Platform: |
Size: 1024 |
Author: snowtiger |
Hits:
Description: 以优化SVR算法的参数c和g为例，对DE（差分进化）算法MATLAB源码进行了详细中文注解。(Differential Evolution algorithm (DE) is a heuristic random search algorithm based on group differences. This algorithm is proposed by R.S and k.p. rice for solving Chebyshev polynomials. DE algorithm is also an intelligent optimization algorithm, which is similar to the previous heuristic algorithm, such as ABC, PSO, etc., which is a heuristic optimization algorithm. The DE algorithm is an optimization algorithm that I used in solving the case study of box coverage.)
Platform: |
Size: 5120 |
Author: mercy认真的雪
|
Hits:
Description: 粒子群算法，也称粒子群优化算法或鸟群觅食算法（Particle Swarm Optimization），缩写为 PSO， 是近年来由J. Kennedy和R. C. Eberhart等 开发的一种新的进化算法(Evolutionary Algorithm - EA)。(Particle swarm optimization (PSO), also known as particle swarm optimization (PSO) or Particle Swarm Optimization (Optimization) and abbreviated as PSO, is a new evolutionary algorithm (Evolutionary Algorithm EA) developed by J. Kennedy and R. C. Eberhart in recent years.)
Platform: |
Size: 1024 |
Author: LEE@123 |
Hits:
Description: 粒子群算法，也称粒子群优化算法或鸟群觅食算法（Particle Swarm Optimization），缩写为 PSO， 是近年来由J. Kennedy和R. C. Eberhart等开发的一种新的进化算法(Evolutionary Algorithm - EA)。PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。(Particle Swarm Optimization, also known as Particle Swarm Optimization or Particle Swarm Optimization, abbreviated as PSO, is a new evolutionary algorithm developed by J. Kennedy and RC Eberhart in recent years (Evolutionary Algorithm - EA). ). The PSO algorithm is a kind of evolutionary algorithm. It is similar to the simulated annealing algorithm. It also starts from the random solution and finds the optimal solution through iteration. It also evaluates the quality of the solution by fitness, but it is simpler than the rules of genetic algorithm. It does not have the "crossover" and "mutation" operations of the genetic algorithm, which seeks global optimality by following the current searched optimal values. This kind of algorithm has attracted the attention of academic circles because of its advantages of easy implementation, high precision and fast convergence)
Platform: |
Size: 5120 |
Author: 李彤tongtong |
Hits: